沪语语音识别研究及在家居机器人中的应用

为实现对沪语语音的识别和与家居机器人沪语语音交互,通过分析了沪语语言的语音、语调、语法特点,提出了沪语语音的识别基元的建模方法.该方法生成了新的声韵集作为识别基元,并建立了课题相关的沪语语音语料库,同时基于HTK初步构造了沪语语音的声学模型和3-Gramm语言模型.该系统模型在家居服务机器人中得到初步的应用,系统采用V...     

基于Web的家庭安保机器人视频传输的研究与实现

针对家庭安保机器人视频传输问题,在综合比较了几种主流方法的基础上,提出了一种新的基于视频流的方案。对图像进行实时编解码,在保证较好的图像质量的基础上,实现了图像的实时同步,并具有良好的扩展性。实验验证了该方法的先进性与有效性。     

The TianHe-1A Supercomputer: Its Hardware and Software

This paper presents an overview of TianHe-1A (TH-1A) supercomputer, which is built by National University of Defense Technology of China (NUDT). TH-1A adopts a hybrid architecture by integrating CPUs and GPUs, and its interconnect network is a proprietary high-speed communication network. The theoretical peak performance of TH-1A is 4700 TFlops, and its LINPACK test result is 2566 TFlops. It was ranked the No. 1 on the TOP500 List released in November, 2010. TH-1A is now deployed in National Supercomputer Center in Tianjin and provides high performance computing services. TH-1A has played an important role in many applications, such as oil exploration, weather forecast, bio-medical research.     

水下传感器网络节点定位信号检测的设计

针对水下环境的特殊性和水声定位系统的要求,为降低检测水声定位信号的复杂度和硬件资源消耗,能够准确检测定位基站发射的水声定位信号,为目标基站的定位提供实时、快速的时延信息,根据水声定位信号的特点,采用码元匹配检波和编码定位信号相关的方法,确定水声定位信号的到达时间,并以FPGA为平台利用VHDL语言对水声定位信号的检测设...     

一种软件体系结构关注点分析方法

在体系结构的设计、演化和重用过程中涉及众多的关注点,而且它们之间存在着复杂的关系,然而目前还缺乏有效的对这些关注点及其关系进行描述和分析的方法.针对这一问题,在系统收集并显式标识各种体系结构关注点及其关系的基础上,文中提出一种软件体系结构关注点分析方法.该方法利用时段时序逻辑对关注点之间的横切关系进行形式化描述和分析,可以发现横切关注点之间的时序冲突,有助于提高面向方面软件体系结构的设计质量.最后结合案例给出了该方法的实施过程.     

基于SoPC的JPEG2000编码器设计

提出了一种改进的行式二维小波变换器结构,设计了位平面并行的位平面编码器和四级流水线结构的算术编码器,并将其整合于一个SoPC中,实现了JPEG2000编码系统。整个设计通过Altera公司Stratix Ⅱ系列的EP2S60F1020C5平台验证,在最高时钟频率98 MHz下能达到编码分辨率512×512、灰度图像52帧/s的速度,满足了实时编码的要求。     

State complexity of basic operations on suffix-free regular languages

We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages.     

Deciding determinism of caterpillar expressions

Caterpillar expressions have been introduced by Brüggemann-Klein and Wood for applications in markup languages. Caterpillar expressions provide a convenient formalism for specifying the operation of tree-walking automata on unranked trees. Here we give a formal definition of determinism of caterpillar expressions that is based on the language of instruction sequences defined by the expression. We show that determinism of caterpillar expressions can be decided in polynomial time.     

Operational state complexity of nested word automata

We introduce techniques to prove lower bounds for the number of states needed by finite automata operating on nested words. We study the state complexity of Boolean operations and obtain lower bounds that are tight within an additive constant. The results for union and complementation differ from corresponding bounds for ordinary finite automata. For reversal and concatenation, we establish lower bounds that are of a different order than the worst-case bounds for ordinary finite automata.